Partition Functions Of Models Research Articles

Nesting Statistics in the O(n) Loop Model on Random Planar Maps

In the O(n) loop model on random planar maps, we study the depth—in terms of the number of levels of nesting—of the loop configuration, by means of analytic combinatorics. We focus on the ‘refined’ generating series of pointed disks or cylinders, which keep track of the number of loops separating the marked point from the boundary (for disks), or the two boundaries (for cylinders). For the general O(n) loop model, we show that these generating series satisfy functional relations obtained by a modification of those satisfied by the unrefined generating series. In a more specific O(n) model where loops cross only triangles and have a bending energy, we explicitly compute the refined generating series. We analyse their non generic critical behavior in the dense and dilute phases, and obtain the large deviations function of the nesting distribution, which is expected to be universal. Using the framework of Liouville quantum gravity (LQG), we show that a rigorous functional KPZ relation can be applied to the multifractal spectrum of extreme nesting in the conformal loop ensemble (CLEκ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extrm{CLE}_{\\kappa }$$\\end{document}) in the Euclidean unit disk, as obtained by Miller et al. (Ann Probab 44(2):1013–1052, 2016, arXiv:1401.0217), or to its natural generalisation to the Riemann sphere. It allows us to recover the large deviations results obtained for the critical O(n) random planar map models. This offers, at the refined level of large deviations theory, a rigorous check of the fundamental fact that the universal scaling limits of random planar map models as weighted by partition functions of critical statistical models are given by LQG random surfaces decorated by independent CLEs.

On the partition function of the Sp(2n) integrable vertex model

We study the partition function per site of the integrable vertex model on the square lattice. We establish a set of transfer matrix fusion relations for this model. The solution of these functional relations in the thermodynamic limit allows us to compute the partition function per site of the fundamental representation of the vertex model. In addition, we also obtain the partition function of vertex models mixing the fundamental with other representations.

Approximately counting independent sets in bipartite graphs via graph containers

AbstractBy implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first algorithm applies to ‐regular, bipartite graphs satisfying a weak expansion condition: when is constant, and the graph is a bipartite ‐expander, we obtain an FPTAS for the number of independent sets. Previously such a result for was known only for graphs satisfying the much stronger expansion conditions of random bipartite graphs. The algorithm also applies to weighted independent sets: for a ‐regular, bipartite ‐expander, with fixed, we give an FPTAS for the hard‐core model partition function at fugacity . Finally we present an algorithm that applies to all ‐regular, bipartite graphs, runs in time , and outputs a ‐approximation to the number of independent sets.

Disentanglement, disorder lines, and Majorana edge states in a solvable quantum chain

We study the exactly solvable 1D model: the dimerized $XY$ chain with uniform and staggered transverse fields, equivalent upon fermionization to the noninteracting dimerized Kitaev-Majorana chain with modulation. The model has three known gapped phases with local and nonlocal (string) orders, along with the gapless incommensurate (IC) phase in the $U(1)$ limit. The criticality is controlled by the properties of zeros of model's partition function, analytically continued onto the complex wave numbers. In the ground state they become complex zeros of the spectrum of the Hamiltonian. The analysis of those roots yields the phase diagram which contains continuous quantum phase transitions and weaker singularities known as disorder lines (DLs) or modulation transitions. The latter, reported for the first time in this model, are shown to occur in two types: DLs of the first kind with continuous appearance of the IC oscillations, and DLs of the second kind corresponding to a jump of the wave number of oscillations. The salient property of zeros of the spectrum is that the ground state is shown to be separable (factorized) and the model is disentangled on a subset of the DLs. From analysis of those zeros we also find the Majorana edge states and their wave functions.

Zeros and approximations of Holant polynomials on the complex plane

We present fully polynomial time approximation schemesfor a broad class of Holant problems with complex edge weights, whichwe call Holant polynomials. We transform these problems into partitionfunctions of abstract combinatorial structures known as polymersin statistical physics. Our method involves establishing zero-free regionsfor the partition functions of polymer models and using the mostsignificant terms of the cluster expansion to approximate them.Results of our technique include new approximation and sampling algorithmsfor a diverse class of Holant polynomials in the low-temperatureregime (i.e. small external field) and approximation algorithms for generalHolant problems with small signature weights. Additionally, wegive randomised approximation and sampling algorithms with fasterrunning times for more restrictive classes. Finally, we improve theknown zero-free regions for a perfect matching polynomial.

Universal Behavior beyond Multifractality of Wave Functions at Measurement-Induced Phase Transitions.

We investigate the structure of many-body wave functions of 1D quantum circuits with local measurements employing the participation entropies. The leading term in system size dependence of participation entropy indicates a model-dependent multifractal scaling of the wave functions at any nonzero measurement rate. The subleading term contains universal information about measurement-induced phase transitions and plays the role of an order parameter, being constant nonzero in the error-correcting phase and vanishing in the quantum Zeno phase. We provide robust numerical evidence investigating a variety of quantum many-body systems and provide an analytical interpretation of this behavior expressing the participation entropy in terms of partition functions of classical statistical models in 2D.

Matrix model partition function by a single constraint

In the recent study of Virasoro action on characters, we discovered that it gets especially simple for peculiar linear combinations of the Virasoro operators: particular harmonics of {hat{w}}-operators. In this letter, we demonstrate that even more is true: a singlew-constraint is sufficient to uniquely specify the partition functions provided one assumes that it is a power series in time-variables. This substitutes the previous specifications in terms of two requirements: either a string equation imposed on the KP/Toda tau -function or a pair of Virasoro generators. This mysterious single-entry definition holds for a variety of theories, including Hermitian and complex matrix models, and also matrix models with external matrix: the unitary and cubic Kontsevich models. In these cases, it is equivalent to W-representation and is closely related to super integrability. However, a similar single equation that completely determines the partition function exists also in the case of the generalized Kontsevich model (GKM) with potential of higher degree, when the constraint algebra is a larger W-algebra, and neither W-representation, nor superintegrability are understood well enough.

Fluctuations for the partition function of Ising models on Erdös–Rényi random graphs

Nous analysons les modéles d’Ising/Curie–Weiss sur le graphe Erdős–Rényi avec N sommets et probabilité d’arête p=p(N) introduits par Bovier et Gayrard (J. Stat. Phys. 72 (3–4) (1993) 643–664) et étudié dans (J. Stat. Phys. 177 (1) (2019) 78–94) et (Kabluchko, Löwe and Schubert (2019)). Nous montrons des théorèmes limite central pour la fonction de partition du modèle et – à autres régimes de p(N) – pour la fonction de partition logarithmique. Nous trouvons des régimes critiques pour p(N) en lequels le comportement des fluctuations de la fonction de partition change.

Emergent Statistical Mechanics from Properties of Disordered Random Matrix Product States

The study of generic properties of quantum states has led to an abundance of insightful results. A meaningful set of states that can be efficiently prepared in experiments are ground states of gapped local Hamiltonians, which are well approximated by matrix product states. In this work, we introduce a picture of generic states within the trivial phase of matter with respect to their non-equilibrium and entropic properties: We do so by rigorously exploring non-translation-invariant matrix product states drawn from a local i.i.d. Haar-measure. We arrive at these results by exploiting techniques for computing moments of random unitary matrices and by exploiting a mapping to partition functions of classical statistical models, a method that has lead to valuable insights on local random quantum circuits. Specifically, we prove that such disordered random matrix product states equilibrate exponentially well with overwhelming probability under the time evolution of Hamiltonians featuring a non-degenerate spectrum. Moreover, we prove two results about the entanglement Renyi entropy: The entropy with respect to sufficiently disconnected subsystems is generically extensive in the system-size, and for small connected systems the entropy is almost maximal for sufficiently large bond dimensions.

System Size Dependence in the Zimm-Bragg Model: Partition Function Limits, Transition Temperature and Interval.

Within the recently developed Hamiltonian formulation of the Zimm and Bragg model we re-evaluate several size dependent approximations of model partition function. Our size analysis is based on the comparison of chain length N with the maximal correlation (persistence) length of helical conformation. For the first time we re-derive the partition function of zipper model by taking the limits of the Zimm–Bragg eigenvalues. The critical consideration of applicability boundaries for the single-sequence (zipper) and the long chain approximations has shown a gap in description for the range of experimentally relevant chain lengths of 5–10 persistence lengths . Correction to the helicity degree expression is reported. For the exact partition function we have additionally found, that: at the transition temperature reaches its asymptotic behavior of infinite N; the transition interval needs about a thousand persistence lengths to saturate at its asymptotic, infinite length value. Obtained results not only contribute to the development of the Zimm–Bragg model, but are also relevant for a wide range of Biotechnologies, including the Biosensing applications.

An exactly solvable ansatz for statistical mechanics models

We propose a family of ‘exactly solvable’ probability distributions to approximate partition functions of two-dimensional statistical mechanics models. While these distributions lie strictly outside the mean-field framework, their free energies can be computed in a time that scales linearly with the system size. This construction is based on a simple but nontrivial solution to the marginal problem. We formulate two non-linear constraints on the set of locally consistent marginal probabilities that simultaneously (i) ensure the existence of a consistent global probability distribution and (ii) lead to an exact expression for the maximum global entropy.

Statistical mechanical models for quantum codes with correlated noise

We give a broad generalisation of the mapping, originally due to Dennis, Kitaev, Landahl and Preskill, from quantum error correcting codes to statistical mechanical models. We show how the mapping can be extended to arbitrary stabiliser or subsystem codes subject to correlated Pauli noise models, including models of fault tolerance. This mapping connects the error correction threshold of the quantum code to a phase transition in the statistical mechanical model. Thus, any existing method for finding phase transitions, such as Monte Carlo simulations, can be applied to approximate the threshold of any such code, without having to perform optimal decoding. By way of example, we numerically study the threshold of the surface code under mildly correlated bit-flip noise, showing that noise with bunching correlations causes the threshold to drop to $p_{\textrm{corr}}=10.04(6)\%$, from its known iid value of $p_{\text{iid}}=10.917(3)\%$. Complementing this, we show that the mapping also allows us to utilise any algorithm which can calculate/approximate partition functions of classical statistical mechanical models to perform optimal/approximately optimal decoding. Specifically, for 2D codes subject to locally correlated noise, we give a linear-time tensor network-based algorithm for approximate optimal decoding which extends the MPS decoder of Bravyi, Suchara and Vargo.

Comments on the quantum field theory of the Coulomb gas formalism

The holomorphic Coulomb gas formalism, as developed by Feigin-Fuchs, Dotsenko-Fateev and Felder, is a set of rules for computing minimal model observables using free field techniques. We attempt to derive and clarify these rules using standard techniques of quantum field theory. We begin with a careful examination of the timelike linear dilaton. Although the background charge of the model breaks the scalar field’s continuous shift symmetry, the exponential of the action remains invariant under a discrete shift because the background charge is imaginary. Gauging this symmetry makes the dilaton compact and introduces winding modes into the spectrum. One of these winding operators corresponds to the anti-holomorphic completion of the BRST current first introduced by Felder, and the full left/right cohomology of this BRST charge isolates the irreducible representations of the Virasoro algebra within the degenerate Fock space of the linear dilaton. The “supertrace” in the BRST complex reproduces the minimal model partition function and exhibits delicate cancellations between states with both momentum and winding. The model at the radius R=sqrt{pp^{prime }} has two marginal operators corresponding to the Dotsenko-Fateev “screening charges”. Deforming by them, we obtain a model that might be called a “BRST quotiented compact timelike Liouville theory”. The Hamiltonian of the zero-mode quantum mechanics of this model is not Hermitian, but it is PT-symmetric and exactly solvable. Its eigenfunctions have support on an infinite number of plane waves, suggesting an infinite reduction in the number of independent states in the full quantum field theory. Applying conformal perturbation theory to the exponential interactions reproduces the Coulomb gas calculations of minimal model correlation functions. In contrast to spacelike Liouville, these “resonance correlators” are finite because the zero mode is compact. We comment on subtleties regarding the reflection operator identification, as well as naive violations of truncation in correlators with multiple reflection operators inserted. This work is part of an attempt to understand the relationship between the JT model of two dimen- sional gravity and the worldsheet description of the (2, p) minimal string as suggested by Seiberg and Stanford.

Mixed partition functions and exponentially bounded edge-connection rank

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition functions. Mixed partition functions can be seen as a generalization of partition functions of vertex models, as introduced by de la Harpe and Jones, [P. de la Harpe, V.F.R. Jones, Graph invariants related to statistical mechanical models: examples and problems, Journal of Combinatorial Theory, Series B 57 (1993) 207--227] and they are related to invariant theory of orthosymplectic supergroup. We moreover show that evaluations of the characteristic polynomial of a simple graph are examples of mixed partition functions, answering a question of de la Harpe and Jones.

Efficient algorithms for approximating quantum partition functions

We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Netočný and Redig and the cluster expansion approach to designing algorithms due to Helmuth, Perkins, and Regts. Similar results have previously been obtained by related methods, and our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs.

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. In this manuscript, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak (2006 Phys. Rev. E 73 065102; 2006 J. Stat. Mech. 2006 P06009) with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

A reverse Sidorenko inequality

Let H be a graph allowing loops as well as vertex and edge weights. We prove that, for every triangle-free graph G without isolated vertices, the weighted number of graph homomorphisms \(\hom (G, H)\) satisfies the inequality $$\begin{aligned} \hom (G, H ) \le \prod _{uv \in E(G)} \hom (K_{d_u,d_v}, H )^{1/(d_ud_v)}, \end{aligned}$$where \(d_u\) denotes the degree of vertex u in G. In particular, one has $$\begin{aligned} \hom (G, H )^{1/|E(G)|} \le \hom (K_{d,d}, H )^{1/d^2} \end{aligned}$$for every d-regular triangle-free G. The triangle-free hypothesis on G is best possible. More generally, we prove a graphical Brascamp–Lieb type inequality, where every edge of G is assigned some two-variable function. These inequalities imply tight upper bounds on the partition function of various statistical models such as the Ising and Potts models, which includes independent sets and graph colorings. For graph colorings, corresponding to \(H = K_q\), we show that the triangle-free hypothesis on G may be dropped; this is also valid if some of the vertices of \(K_q\) are looped. A corollary is that among d-regular graphs, \(G = K_{d,d}\) maximizes the quantity \(c_q(G)^{1/|V(G)|}\) for every q and d, where \(c_q(G)\) counts proper q-colorings of G.Finally, we show that if the edge-weight matrix of H is positive semidefinite, then $$\begin{aligned} \hom (G, H) \le \prod _{v \in V(G)} \hom (K_{d_v+1}, H )^{1/(d_v+1)}. \end{aligned}$$This implies that among d-regular graphs, \(G = K_{d+1}\) maximizes \(\hom (G, H)^{1/|V(G)|}\). For 2-spin Ising models, our results give a complete characterization of extremal graphs: complete bipartite graphs maximize the partition function of 2-spin antiferromagnetic models and cliques maximize the partition function of ferromagnetic models. These results settle a number of conjectures by Galvin–Tetali, Galvin, and Cohen–Csikvári–Perkins–Tetali, and provide an alternate proof to a conjecture by Kahn.

CHL Calabi–Yau threefolds: curve counting, Mathieu moonshine and Siegel modular forms

A CHL model is the quotient of $\mathrm{K3} \times E$ by an order $N$ automorphism which acts symplectically on the K3 surface and acts by shifting by an $N$-torsion point on the elliptic curve $E$. We conjecture that the primitive Donaldson-Thomas partition function of elliptic CHL models is a Siegel modular form, namely the Borcherds lift of the corresponding twisted-twined elliptic genera which appear in Mathieu moonshine. The conjecture matches predictions of string theory by David, Jatkar and Sen. We use the topological vertex to prove several base cases of the conjecture. Via a degeneration to $\mathrm{K3} \times \mathbb{P}^1$ we also express the DT partition functions as a twisted trace of an operator on Fock space. This yields further computational evidence. An extension of the conjecture to non-geometric CHL models is discussed. We consider CHL models of order $N=2$ in detail. We conjecture a formula for the Donaldson-Thomas invariants of all order two CHL models in all curve classes. The conjecture is formulated in terms of two Siegel modular forms. One of them, a Siegel form for the Iwahori subgroup, has to our knowledge not yet appeared in physics. This discrepancy is discussed in an appendix with Sheldon Katz.

Tensor renormalization group centered about a core tensor

We propose a modified form of a tensor renormalization group algorithm for evaluating partition functions of classical statistical mechanical models on 2D lattices. This algorithm coarse-grains only the rows and columns of the lattice adjacent to a single core tensor at each step, such that the lattice size shrinks linearly with the number of coarse-graining steps as opposed to shrinking exponentially as in the usual tensor renormalization group (TRG). However, the cost of this new approach only scales as $O(\chi^4)$ in terms of the bond dimension $\chi$, significantly cheaper than the $O(\chi^6)$ cost scaling of TRG, whereas numerical benchmarking indicates that both approaches have comparable accuracy for the same bond dimension $\chi$. It follows that the new algorithm can allow for more accurate investigation of classical models on modestly sized lattices than is possible with standard TRG.

Algorithms for estimating the partition function of restricted Boltzmann machines

Accurate estimates of the normalization constants (partition functions) of energy-based probabilistic models (Markov random fields) are highly important, for example, for assessing the performance of models, monitoring training progress, and conducting likelihood ratio tests. Several algorithms for estimating the partition function (in relation to a reference distribution) have been introduced, including Annealed Importance Sampling (AIS) and Bennett's Acceptance Ratio method (BAR). However, their conceptual similarities and differences have not been worked out so far and systematic comparisons of their behavior in practice have been missing. We devise a unifying theoretical framework for these algorithms, which comprises existing variants and suggests new approaches. It is based on a generalized form of Crooks' equality linking the expectation over a distribution of samples generated by a transition operator to the expectation over the distribution induced by the reversed operator. The framework covers different ways of generating samples, such as parallel tempering and path sampling. An empirical comparison revealed the differences between the methods when estimating the partition function of restricted Boltzmann machines and Ising models. In our experiments, BAR using parallel tempering worked well with a small number of bridging distributions, while path sampling based AIS performed best when many bridging distributions were available. Because BAR gave the overall best results, we favor it over AIS. Furthermore, the experiments showed the importance of choosing a proper reference distribution.